A note on the Neuman-Sándor mean
نویسندگان
چکیده
منابع مشابه
Optimal bounds for Neuman-Sándor mean in terms of the convex combination of the logarithmic and the second Seiffert means
In the article, we prove that the double inequality [Formula: see text] holds for [Formula: see text] with [Formula: see text] if and only if [Formula: see text] and [Formula: see text], where [Formula: see text], [Formula: see text] and [Formula: see text] denote the Neuman-Sándor, logarithmic and second Seiffert means of two positive numbers a and b, respectively.
متن کاملOn Certain Inequalities for Neuman-Sándor Mean
and Applied Analysis 3 (a, b), and let g(x) ̸ = 0 on (a, b). If f(x)/g(x) is increasing (decreasing) on (a, b), then so are f (x) − f (a) g (x) − g (a) , f (x) − f (b) g (x) − g (b) . (11) If f(x)/g(x) is strictly monotone, then the monotonicity in the conclusion is also strict. Lemma 6 (see [11, Lemma 1.1]). Suppose that the power series f(x) = ∑ ∞ n=0 a n x n and g(x) = ∑∞ n=0 b n x n hav...
متن کاملA Note on the Hypergeometric Mean Value
in terms of power means and other related means have precipitated the search for similar bounds for the more general 2F1(α, β; γ; r). In an early paper, B. C. Carlson considered the approximation of the hypergeometric mean values ( 2F1(−a, b; b + c; r)) in terms of means of order t, given by Mt(s, r) := {(1 − s) + s(1 − r)t}1/t. In this note, a refinement of one such approximation is establishe...
متن کاملA Note on Mixed-Mean Inequalities
We give a simpler proof of a result of Holland concerning a mixed arithmetic-geometric mean inequality. We also prove a result of mixed mean inequality involving the symmetric means.
متن کاملA note on finding minimum mean cycle
In a directed graph with edge weights, the mean weight of a directed cycle is the weight of its edges divided by their number. The minimum cycle mean of the graph is the minimum mean weight of a cycle. Karp gave a characterization of minimum cycle mean and an O(nm) algorithm to compute it, where n is the number of vertices and m is the number of edges. However, an algorithm he suggested for ide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Inequalities
سال: 2014
ISSN: 1846-579X
DOI: 10.7153/jmi-08-20